Abstraction Heuristics for Symbolic Bidirectional Search
نویسندگان
چکیده
ion Heuristics for Symbolic Bidirectional Search
منابع مشابه
Constrained Symbolic Search: On Mutexes, BDD Minimization and More
Symbolic search allows saving large amounts of memory compared to regular explicit-state search algorithms. This is crucial in optimal settings, in which common search algorithms often exhaust the available memory. So far, the most successful uses of symbolic search have been bidirectional blind search and the generation of abstraction heuristics like Pattern Databases. Despite its usefulness, ...
متن کاملSubsumer-first: A new Heuristic for Guided Symbolic Reachability Analysis
State space exploration using symbolic techniques provides a basis for the verification of software systems. The exploration procedure has direct impact on the overall effectiveness of the verification efforts. For example, choosing the breadth-first exploration strategy results in a verification tool that finds counterexamples quickly, but may sacrifice the efficiency of the reachability analy...
متن کاملStronger Abstraction Heuristics Through Perimeter Search
Perimeter search is a bidirectional search algorithm consisting of two phases. In the first phase, a limited regression search computes the perimeter, a region which must necessarily be passed in every solution. In the second phase, a heuristic forward search finds an optimal plan from the initial state to the perimeter. The drawback of perimeter search is the need to compute heuristic estimate...
متن کاملEfficient Testing of Concurrent Programs with Abstraction-Guided Symbolic Execution
ion-Guided Symbolic Execution Neha Rungta, Eric G Mercer and Willem Visser∗ Dept. of Computer Science, Brigham Young University, Provo, UT 84602, USA ∗SEVEN Networks, 901 Marshall Street, Redwood City, CA 94063, USA Abstract. Exhaustive search techniques such as model checking and Exhaustive search techniques such as model checking and symbolic execution are insufficient to detect errors in con...
متن کاملCombining Perimeter Search and Pattern Database Abstractions
A pattern database abstraction (PDB) is a heuristic function in a form of a lookup table. A PDB stores the cost of optimal solutions for instances of abstract problems (subproblems). These costs are used as admissible heuristics for the original problem. Perimeter search (PS) is a form of bidirectional search. First, a breadth-first search is performed backwards from the goal state. Then, a for...
متن کامل